Unique Symbolic Factorization for Fast Contingency Analysis Using Full Newton–Raphson Method
نویسندگان
چکیده
Contingency analysis plays an important role in assessing the static security of a network. Its purpose is to check whether system can operate safely when some elements are out service. In real-time application, computational time required perform calculation paramount for operators take immediate actions prevent cascading outages. Therefore, numerical performance contingency main focus this current research. power flow calculation, solving network equations with sparse matrix solver, most spent factorizing Jacobian matrix. terms computation time, symbolic factorization costliest operation LU (Lower-upper) process. This paper proposes novel method only one using full Newton–Raphson-based generic formulation and modular approach (GFMA). The retained be used during iterations any scenario. A computer study demonstrates that reusing same greatly reduces improves performance. Power assessment under N-1 N-2 conditions performed IEEE standard 54-bus 108-bus evaluate proposed method. comparison conventional shows shortened considerably, minimum gain 228%. comparative solution has better large-scale networks.
منابع مشابه
analysis of ruin probability for insurance companies using markov chain
در این پایان نامه نشان داده ایم که چگونه می توان مدل ریسک بیمه ای اسپیرر اندرسون را به کمک زنجیره های مارکوف تعریف کرد. سپس به کمک روش های آنالیز ماتریسی احتمال برشکستگی ، میزان مازاد در هنگام برشکستگی و میزان کسری بودجه در زمان وقوع برشکستگی را محاسبه کرده ایم. هدف ما در این پایان نامه بسیار محاسباتی و کاربردی تر از روش های است که در گذشته برای محاسبه این احتمال ارائه شده است. در ابتدا ما نشا...
15 صفحه اولUnique Factorization Theorem and Formal Concept Analysis
In the theory of generalised colourings of graphs, the Unique Factorization Theorem (UFT) for additive induced-hereditary properties of graphs provides an analogy of the well-known Fundamental Theorem of Arithmetics. The purpose of this paper is to present a new, less complicated, proof of this theorem that is based on Formal Concept Analysis. The method of the proof can be successfully applied...
متن کاملUsing Postordering and Static Symbolic Factorization for Parallel Sparse LU
In this paper we present several improvements of widely used parallel LU factorization methods on sparse matrices. First we introduce the LU elimination forest and then we characterize the L, U factors in terms of their corresponding LU elimination forest. This characterization can be used as a compact storage scheme of the matrix as well as of the task dependence graph. To improve the use of B...
متن کاملFast Voltage and Power Flow Contingency Ranking Using Enhanced Radial Basis Function Neural Network
Deregulation of power system in recent years has changed static security assessment to the major concerns for which fast and accurate evaluation methodology is needed. Contingencies related to voltage violations and power line overloading have been responsible for power system collapse. This paper presents an enhanced radial basis function neural network (RBFNN) approach for on-line ranking of ...
متن کاملA new approach for building recommender system using non negative matrix factorization method
Nonnegative Matrix Factorization is a new approach to reduce data dimensions. In this method, by applying the nonnegativity of the matrix data, the matrix is decomposed into components that are more interrelated and divide the data into sections where the data in these sections have a specific relationship. In this paper, we use the nonnegative matrix factorization to decompose the user ratin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Energies
سال: 2023
ISSN: ['1996-1073']
DOI: https://doi.org/10.3390/en16114279